A combinatorial maximum cover approach to 2D translational geometric covering
نویسندگان
چکیده
The goal of this research is to provide practical solutions for covering problems. Covering problems arise in a variety of practical settings such as manufacturing, telecommunications, spatial query optimization, publish/subscribe middleware, graphics, molecular modeling, medical treatment and mobile military sensor coverage and targeting. For example, in the mobile sensor case a region is associated with each sensor representing the extent of its coverage. The goal is to find placements of the sensors so that, together, they cover a collection of target regions. This section specifies the covering problem addressed here, surveys related work and gives an overview of the remainder of the paper.
منابع مشابه
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering decision problems for shapes bounded by spline curves. As a first step in addressing these problems, this paper treats translational spline covering for planar, uniform, cubic B-splines. Inner and outer polygonal approxim...
متن کاملA Partition-Based Heuristic for Translational Box Covering
Geometric covering problems are found in application domains such as sensor coverage and repairing of materials. This paper considers covering problems in which a target shape to be covered is specified and a set of covering shapes is supplied. The goal is to find translational positions of the covering shapes that allow them to collectively cover the target. All the shapes are orthotopes (conv...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملWeighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
The minimum-weight set cover problem is widely known to be O(log n)-approximable, with no improvement possible in the general case. We take the approach of exploiting problem structure to achieve better results, by providing a geometry-inspired algorithm whose approximation guarantee depends solely on an instance-specific combinatorial property known as shallow cell complexity (SCC). Roughly sp...
متن کاملGeometric Red-Blue Set Cover for Unit Squares and Related Problems
We study a geometric version of the Red-Blue Set Cover problem originally proposed by Carr, Doddi, Konjevod, and Marathe (SODA 2000): given a red point set, a blue point set, and a set of objects, we want to choose a subset of objects to cover all the blue points, while minimizing the number of red points covered. We prove that the problem is NP-hard even when the objects are unit squares in 2D...
متن کامل